On Randomly Generated Intersecting Hypergraphs
نویسندگان
چکیده
An intersecting hypergraph is one in which each pair of edges has a nonempty intersection. Here, we consider r-uniform hypergraphs which are those for which all edges contain r vertices. ∗Supported in part by NSF grant DMS-0100400. †Supported in part by NSF grant CCR-9818411. ‡Supported in part by NSF VIGRE grant DMS-9819950. §Research was partially supported by OTKA Grants T 030059, T 029074, T 038198, by the Bolyai Foundation and by KFKI-ISYS Datamining Lab. and by a NATO Collaborative Linkage Grant
منابع مشابه
On Randomly Generated Non-Trivially Intersecting Hypergraphs
We propose two procedures to choose members of ([n] r ) sequentially at random to form a non-trivially intersecting hypergraph. In both cases we show what is the limiting probability that if r = cnn 1/3 with cn → c, then the process results in a Hilton-Milner-type hypergraph.
متن کاملCoverings and matchings in r-partite hypergraphs
Ryser’s conjecture postulates that, for r-partite hypergraphs, τ ≤ (r − 1)ν where τ is the covering number of the hypergraph and ν is the matching number. Although this conjecture has been open since the 1960s, researchers have resolved it for special cases such as for intersecting hypergraphs where r ≤ 5. In this paper, we prove several results pertaining to matchings and coverings in r-partit...
متن کاملA Note on Intersecting Hypergraphs with Large Cover Number
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r − 4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a long-standing unsolved conjecture due to Ryser is close to being best possible for every value of r.
متن کاملExact Algorithms for List-Coloring of Intersecting Hypergraphs
We show that list-coloring for any intersecting hypergraph of m edges on n vertices, and lists drawn from a set of size at most k, can be checked in quasi-polynomial time (mn)o(k log(mn)). 1998 ACM Subject Classification G.2.1 Combinatorial algorithms, G.2.2 Hypergraphs
متن کاملOn Helly Hypergraphs with Variable Intersection Sizes
A hypergraphH is said to be p-Helly when every p-wise intersecting partial hypergraph H′ of H has nonempty total intersection. Such hypergraphs have been characterized by Berge and Duchet in 1975, and since then they have appeared in the literature in several contexts, especially for the case p = 2, in which they are referred simply as Helly hypergraphs. An interesting generalization of p-Helly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003